From Open Set to Closed Set: Supervised Spatial Divide-and-Conquer for Object Counting
نویسندگان
چکیده
Visual counting, a task that aims to estimate the number of objects from an image/video, is open-set problem by nature as population can vary in $$[0,+\infty )$$ theory. However, collected data are limited reality, which means only closed set observed. Existing methods typically model this through regression, while they prone suffer unseen scenes with counts out scope set. In fact, counting has interesting and exclusive property—spatially decomposable. A dense region always be divided until sub-region within previously observed We therefore introduce idea spatial divide-and-conquer (S-DC) transforms into problem. This implemented novel Supervised Spatial Divide-and-Conquer Network (SS-DCNet). It learn but generalize scenarios via S-DC. provide mathematical analyses controlled experiment on synthetic data, demonstrating why closed-set modeling works well. Experiments show SS-DCNet achieves state-of-the-art performance crowd vehicle plant counting. also demonstrates superior transferablity under cross-dataset setting. Code models available at: https://git.io/SS-DCNet .
منابع مشابه
Divide-and-Conquer Algorithm for Computing Set Containment Joins
A set containment join is a join between set-valued attributes of two relations, whose join condition is speci ed using the subset ( ) operator. Set containment joins are used in a variety of database applications. In this paper, we propose a novel partitioning algorithm called Divide-and-Conquer Set Join (DCJ) for computing set containment joins eÆciently. We show that the divide-and-conquer a...
متن کاملEvolutionary Divide and Conquer for the Set-Covering Problem
Genetic Algorithms provide a weak search method that scales rather badly when used in their traditional form. On the other hand, the set covering problem, when used to solve real-world problems, presents an enormous search space for genetic algorithms. A method is presented, by which genetic material is maintained for a long time within the population to allow a greater portion of the search sp...
متن کاملMaximum Independent Set for Intervals by Divide-Prune-and-Conquer
As an easy example of divide, prune, and conquer, we give an output-sensitive O(n log k)-time algorithm to compute, for n intervals, a maximum independent set of size k.
متن کاملSemi-supervised learning on closed set lattices
We propose a new approach for semi-supervised learning using closed set lattices, which have been recently used for frequent pattern mining within the framework of the data analysis technique of Formal Concept Analysis (FCA). We present a learning algorithm, called SELF (SEmi-supervised Learning via FCA), which performs as a multiclass classifier and a label ranker for mixed-type data containin...
متن کاملCounting independent sets via Divide Measure and Conquer method
Abstract. In this paper we give an algorithm for counting the number of all independent sets in a given graph which works in time O(1.1394) for subcubic graphs and in time O(1.2369) for general graphs, where n is the number of vertices in the instance graph, and polynomial space. The result comes from combining two well known methods “Divide and Conquer” and “Measure and Conquer”. We introduce ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2023
ISSN: ['0920-5691', '1573-1405']
DOI: https://doi.org/10.1007/s11263-023-01782-1